Incomplete LU preconditioner for FMM implementation
نویسندگان
چکیده
منابع مشابه
The flexible incomplete LU preconditioner for large nonsymmetric linear systems
The ILU factorization is one of the most popular preconditioners for the Krylov subspace method, alongside the GMRES. Properties of the preconditioner derived from the ILU factorization are relayed onto the dropping rules. Recently, Zhang et al. [Numer. Linear. Algebra. Appl., Vol. 19, pp. 555–569, 2011] proposed a Flexible incomplete Cholesky (IC) factorization for symmetric linear systems. Th...
متن کاملILUS: An Incomplete LU Preconditioner in Sparse Skyline Format
Incomplete LU factorizations are among the most eeective preconditioners for solving general large, sparse linear systems arising from practical engineering problems. This paper shows how an ILU factorization may be easily computed in sparse skyline storage format, as opposed to traditional row-by-row schemes. This organization of the factorization has many advantages, including its amenability...
متن کاملComputing a block incomplete LU preconditioner as the by-product of block left-looking A-biconjugation process
In this paper, we present a block version of incomplete LU preconditioner which is computed as the by-product of block A-biconjugation process. The pivot entries of this block preconditioner are one by one or two by two blocks. The L and U factors of this block preconditioner are computed separately. The block pivot selection of this preconditioner is inherited from one of the block versions of...
متن کاملA Minimum-Phase LU Factorization Preconditioner for Toeplitz Matrices
A new preconditioner is proposed for the solution of an N x N Toeplitz system TNX = b, where TN can be symmetric indefinite or nonsymmetric, by preconditioned iterative methods. The preconditioner FN is obtained based on factorizing the generating function T(z) into the product of two terms corresponding, respectively, to minimum-phase causal and anticausal systems and therefore called the mini...
متن کاملThe Highly Parallel Incomplete Gram-Schmidt Preconditioner
In this paper we study the parallel aspects of IMGS, Incomplete Modiied Gram-Schmidt preconditioner which can be used for ef-ciently solving sparse and large linear systems and least squares problems on massively parallel distributed memory computers. The performance of this preconditioning technique on this kind of architecture is always limited because of the global communication required for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Microwave and Optical Technology Letters
سال: 2000
ISSN: 0895-2477,1098-2760
DOI: 10.1002/1098-2760(20000820)26:4<265::aid-mop18>3.0.co;2-o